Connectivity of discrete planes
نویسندگان
چکیده
منابع مشابه
Connectivity of discrete planes
Studying connectivity of discrete objects is a major issue in discrete geometry and topology. In the present work we deal with connectivity of discrete planes in the framework of Reveillès analytical definition [11]. Accordingly, a discrete plane is a set P (a, b, c, μ, ω) of integer points (x, y, z) satisfying the Diophantine inequalities 0 ≤ ax + by + cz + μ < ω. The parameter μ ∈ Z estimates...
متن کاملGeneration of discrete planes
We consider the problem of generation of discrete planes using generalized substitutions. We give sufficient conditions to be sure to generate all of a discrete plane by a sequence of substitutions; these conditions, however, are not easy to check, even on simple examples. One can build approximations of discrete planes in several ways, namely as stepped surfaces (unions of faces), as sets of v...
متن کاملAnalytical properties of discrete planes
Some classes of medical images can be represented by meshes of discrete polygons that are portions of discrete planes, while the polygon edges are segments of discrete lines. Classically, the discrete planes and lines are defined algorithmically. While being quite satisfactory regarding various practical purposes, these definitions are not always easy to use for obtaining deep structural result...
متن کاملDiscrete Surface Segmentation into Discrete Planes
This paper is composed of two parts. In the first one, we present an analysis of existing discrete surface segmentation algorithms. We show that two classes of algorithms can actually be defined according to discrete surface and plane definitions. In the second part, we prove the link between the two classes presented. To do so, we propose a new labelling of the surface elements which leads to ...
متن کاملDiscrete surfaces segmentation into discrete planes
This paper is composed of two parts. In the first one, we present an analysis of existing discrete surface segmentation algorithms. We show that two classes of algorithms can actually be defined according to discrete surface and plane definitions. In the second part, we prove the link between the two classes presented. To do so, we propose a new labelling of the surface elements which leads to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.02.015